package com.jia.leetCode;

public class Pro1385 {
    public int findTheDistanceValue(int[] arr1, int[] arr2, int d) {
        int ans = 0;
        for(int i = 0; i < arr1.length; i++) {
            int j = 0;
            for(; j < arr2.length; j++) {
                if(Math.abs(arr1[i] - arr2[j]) <= d) { break; }
            }
            if(j == arr2.length) {
                ++ans;
            }
        }
        return ans;
    }
}
